翻訳と辞書
Words near each other
・ Boole (band)
・ Boole (crater)
・ Boole (disambiguation)
・ Boole (tree)
・ Boole polynomials
・ Boole's expansion theorem
・ Boole's inequality
・ Boole's rule
・ Boole's syllogistic
・ Boolean
・ Boolean algebra
・ Boolean algebra (structure)
・ Boolean algebras canonically defined
・ Boolean analysis
・ Boolean circuit
Boolean conjunctive query
・ Boolean data type
・ Boolean delay equation
・ Boolean domain
・ Boolean expression
・ Boolean function
・ Boolean grammar
・ Boolean hierarchy
・ Boolean model (probability theory)
・ Boolean network
・ Boolean operation
・ Boolean operations on polygons
・ Boolean prime ideal theorem
・ Boolean ring
・ Boolean satisfiability problem


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Boolean conjunctive query : ウィキペディア英語版
Boolean conjunctive query
In the theory of relational databases, a Boolean conjunctive query is a conjunctive query without distinguished predicates, i.e., a query in the form R_1(t_1) \wedge \cdots \wedge R_n(t_n), where each R_i is a relation symbol and each t_i is a tuple of variables and constants; the number of elements in t_i is equal to the arity of R_i. Such a query evaluates to either true or false depending on whether the relations in the database contain the appropriate tuples of values, i.e. the conjunction is valid according to the facts in the database.
As an example, if a database schema contains the relation symbols Father (binary, who's the father of whom) and Employed (unary, who is employed), a conjunctive query could be Father(Mark, x) \wedge Employed(x). This query evaluates to true if there exists an individual x who is a child of Mark and employed. In other words, this query expresses the question: "does Mark have employed children?"
==See also==

*Logical conjunction
*Conjunctive query

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Boolean conjunctive query」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.